458 [Dec. PASCAL'S TRIANGLE MODULO
نویسنده
چکیده
In "Mathematical Games" in the December 1966 issue of Scientific American, Martin Gardner made the following statement regarding Pascals triangle: "Almost anyone can study the triangle and discover more properties, but it is unlikely that they will be new, for what is said here only scratches the surface of a vast literature." But, of course, many new results have been discovered since 1966 and we present some here that were even suggested by Gardner's article, although the more immediate stimulation was the recent brief article by S. H. L. Kung [3] concerning the parity of entries in Pascal's triangle.
منابع مشابه
Geometry of Binomial Coefficients
This note describes the geometrical pattern of zeroes and ones obtained by reducing modulo two each element of Pascal's triangle formed from binomial coefficients. When an infinite number of rows of Pascal's triangle are included, the limiting pattern is found to be "self-similar," and is characterized by a "fractal dimension" log2 3. Analysis of the pattern provides a simple derivation of the ...
متن کاملIn - Depth Coverage of the Icon Programming Language
It has long been known that modular arithmetic often produces interesting numerical patterns. These patterns can be made easier to comprehend and more interesting by rendering them as images with colors associated with numerical values. The example most often cited is Pascal's Triangle , which exhibits the binomial coefficients. If you take the coefficients modulo m for various m, you get diffe...
متن کاملExplicit definition of the binary reflected Gray codes
It is shown that for 1 j n and 1 k 2; the jth letter of the kth word of the binary re ected Gray code of length n is equal to the parity of the binomial coe cient 2 n 2 j C[2n 2 j 1 k=2] modulo 2. Also it is shown how this observation and the usual iterative de nition of the binary re ected Gray codes are revealed in a modi ed version of Sierpinski's gasket (Pascal's triangle modulo 2).
متن کاملThe density of ones in Pascal's rhombus
Pascal’s rhombus is a variation of Pascal’s triangle in which values are computed as the sum of four terms, rather than two. It is shown that the limiting ratio of the number of ones to the number of zeros in Pascal’s rhombus, taken modulo 2, approaches zero. An asymptotic formula for the number of ones in the rhombus is also shown. c © 1999 Elsevier Science B.V. All rights reserved
متن کاملBINOMIAL - COEFFICIENT MULTIPLES OF IRRATIONALSTerrence
Denote by x a random innnite path in the graph of Pascal's triangle (left and right turns are selected independently with xed probabilities) and by d n (x) the binomial coeecient at the n'th level along the path x. Then for a dense G set of in the unit interval, fd n (x)g is almost surely dense but not uniformly distributed modulo 1.
متن کامل